Ant Colony System Sanitization Approach to Hiding Sensitive Itemsets
نویسندگان
چکیده
منابع مشابه
Hiding Sensitive Frequent Itemsets by a Border-Based Approach
Nowadays, sharing data among organizations is often required during the business collaboration. Data mining technology has enabled efficient extraction of knowledge from large databases. This, however, increases risks of disclosing the sensitive knowledge when the database is released to other parties. To address this privacy issue, one may sanitize the original database so that the sensitive k...
متن کاملInformation Hiding Using Ant Colony Optimization Algorithm
This paper aims to find an effective and efficient information hiding method used for protecting secret information by embedding it in a cover media such as images. Finding the optimal set of the image pixel bits to be substituted by the secret message bits, such that the cover image is of high quality, is a complex process and there is an exponential number of feasible solutions. Two new ant-b...
متن کاملA Revised Ant Colony System Approach to Vehicle Routing Problems
Vehicle routing problems have various extensions such as time windows, multiple vehicles, backhauls, simultaneous delivery and pick-up, etc. The objectives of all these problems are to design optimal routes minimizing total distance traveled, minimizing number of vehicles, etc that satisfy corresponding constraints. In this study, an ant colony optimization based heuristic that can be used to s...
متن کاملReview on Hiding the Sensitive High Utility Itemsets
The Association Rule Mining is the traditional mining technique which identifies the frequent itemsets from the databases and this technique generates the rules by considering the each items. The traditional association rule mining fails to obtain the infrequent itemsets with higher profit. Since association rule mining technique treats all the items in the database equally by considering only ...
متن کاملAnt Colony System Optimization
Successful heuristic algorithms for solving combinatorial optimization problems have mimicked processes observed in nature. Two highly successful families of algorithms that do this are simulated annealing and genetic algorithms. Here, a third family of algorithms, ant colony optimization is explored and implemented in C#. The test bed for evaluating the quality of solutions is based on several...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2017
ISSN: 2169-3536
DOI: 10.1109/access.2017.2702281